A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints

This paper addresses the two-dimensional bin packing problem with guillotine constraints. The requires a set of rectangular items to be cut from larger rectangles, known as bins, while only making use edge-to-edge (guillotine) cuts. goal is minimize total area needed all required items. also variants which permit 90∘ rotation and/or heterogeneous bins. A novel heuristic introduced based on ruin and recreate paradigm combined goal-driven approach. When applying proposed benchmark instances literature, it outperforms current state-of-the-art algorithms in terms solution quality for considered.